Computer Science and Engineering

Discrete Mathematics - I
  1. Partial Order and Hasse Diagram
  2. Equivalence Relation
  3. Diagonalization
  4. Binomial Coefficients, Pascal’s Triangle
  5. Propositional Logic: Syntax and Inference
  6. Propositional Logic: Semantics and Satisfiability
  7. Recursion